#include<iostream>
using namespace std;

#include"BinarySearchTree.h"

void TestBSTr1()
{
	BSTree<int> t;
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	for (auto e : a)
	{
		t.Insert(e);
	}
	t.InOrder();
	//cout << t.Find(15) << endl;

	for (auto e : a)
	{
		t.Erase(e);
		t.InOrder();
	}
}
void TestBSTr2()
{
	BSTree<int> t1;
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	for (auto e : a)
	{
		t1.Insert(e);
	}
	t1.InOrder();

	BSTree<int> t2(t1);
	t2.InOrder();

	BSTree<int> t3 = t1;
	t3.InOrder();
}


int main()
{
	TestBSTr2();
	return 0;
}